Spread Spectrum Storage with Mnemosyne
نویسندگان
چکیده
We motivate and describe Mnemosyne1, a highly private and reliable distributed storage system built over a number of untrusted, unreliable block stores. A client selects the pseudo-random set of block locations used to store a particular file by successive hashing of an initial key value. Resiliency to collisions is obtained by the use of erasure codes. The resulting system operates with decentralized key generation, is resistant to targeted attacks, and has soft capacity dependent on current load.
منابع مشابه
Transaction-Based Charging in Mnemosyne: A Peer-to-Peer Steganographic Storage System
Mnemosyne is a peer-to-peer steganographic storage system: one in which the existence of a user’s files cannot be verified without a key. This paper applies the techniques used in Mnemosyne—erasure codes and anonymous block writing—to move most of the administrative overhead of a commercial storage service over to the client, resulting in cost savings for the service provider. The contribution ...
متن کاملMnemosyne: Peer-to-Peer Steganographic Storage
We present the design of Mnemosyne1 , a peer-topeer steganographic storage service. Mnemosyne provides a high level of privacy and plausible deniability by using a large amount of shared distributed storage to hide data. Blocks are dispersed by secure hashing, and loss codes used for resiliency. We discuss the design of the system, and the challenges posed by traffic analysis.
متن کاملPersistent Memory Programming Abstractions in Context of Concurrent Applications
The advent of non-volatile memory (NVM) technologies like PCM, STT, memristors and Fe-RAM is believed to enhance the system performance by getting rid of the traditional memory hierarchy by reducing the gap between memory and storage. This memory technology is considered to have the performance like that of DRAM and persistence like that of disks. Thus, it would also provide significant perform...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کامل